Quantum Algorithm Processor For Finding Exact Divisors

Introduction The goal is to find factors of a given number N with n bits as required for various purposes. This may be done in a quantum algorithm processor fabricated in CMOS as originally promoted by the author [1]. Each register may execute in parallel the instructions in a wiring diagram to accomplish division by integers from 2 to √N. This amounts to dividing by all n/2 bit divisors (for n even). A zero remainder is indicative of exact factors. Nonrestoring division, the kind that does not use zeros in the quotient, was considered and found not to work as well for detecting zero remainders. This section suggests an appropriate wiring diagram that accomplishes restoring division. Later, to illustrate a tradeoff, division by successive subtraction is considered.